Schur complement method with iterative solver for 2D field- circuit coupling finite element problem with movement
نویسندگان
چکیده
The analysis and design of electromechanical devices involve the solution of large sparse linear systems, and require therefore high performance algorithms. In this paper, the Schur complement method with parallel preconditioned conjugate gradient (PCG) solver is introduced in two-dimensional parallel time-stepping finite element formulation to analyse rotating machine considering the electromagnetic field, external circuit and rotor movement. The proposed parallel solver is analysed concerning its computational efficiency and number of iterations. Simulation results of a rotating machine are also presented. Streszczenie. Analiza i projektowanie urządzeń elektromechanicznych zawierają rozwiązanie dużych układów równań z macierzami rzadkimi, i dlatego wymagają algorytmów o wysokiej wydajności. W artykule metodę uzupełnień Schura z algorytmem opartym na metodzie gradientów sprzężonych wprowadzono do dwuwymiarowego, równoległego, czasowokrokowego sformułowania elementów skończonych do analizy maszyny elektrycznej od strony pola elektromagnetycznego, obwodu elektrycznego zewnętrznego oraz ruchu wirnika. Proponowany równoległy algorytm został poddany analizie pod kątem jego wydajności obliczeniowej, oraz liczby iteracji. Rezultaty symulacji maszyny wirującej są także przytoczone. (Metoda uzupełnienia Schura z iteracyjnym algorytmem dla dwuwymiarowego obwodowo-polowego sprzężonego elementowoskończeniowego problemu z uwzględnieniem ruchu).
منابع مشابه
Coupling Nonlinear Element Free Galerkin and Linear Galerkin Finite Volume Solver for 2D Modeling of Local Plasticity in Structural Material
This paper introduces a computational strategy to collaboratively develop the Galerkin Finite Volume Method (GFVM) as one of the most straightforward and efficient explicit numerical methods to solve structural problems encountering material nonlinearity in a small limited area, while the remainder of the domain represents a linear elastic behavior. In this regard, the Element Free Galerkin met...
متن کاملA Schur complement formulation for solving free-boundary, Stefan problems in solidification
A Schur complement formulation that utilizes a linear iterative solver is derived to solve a free-boundary, Stefan problem describing steady-state solidification via the Isotherm–Newton approach, which employs Newton’s method to simultaneously and efficiently solve for both interface and field equations. This formulation is tested alongside more traditional solution strategies that employ direc...
متن کاملNavier-Stokes Equations in Rotation Form: A Robust Multigrid Solver for the Velocity Problem
The topic of this paper is motivated by the Navier–Stokes equations in rotation form. Linearization and application of an implicit time stepping scheme results in a linear stationary problem of Oseen type. In well-known solution techniques for this problem such as the Uzawa (or Schur complement) method, a subproblem consisting of a coupled nonsymmetric system of linear equations of diffusion-re...
متن کاملInstitut F Ur I F Am Angewandte Mathematik Hierarchical Basis Preconditioners for Coupled Fem{bem Equations Hierarchcal Basis Preconditioners for Coupled Fem{bem Equations
The purpose of this paper is to present a nearly optimal preconditioned iterative method to solve indeenite linear systems of equations arising from h-adaptive procedures for the symmetric coupling of Finite Elements and Boundary Elements. This solver is nearly optimal in the sense, that its convergence rate grows only logarithmically with the number of unknowns. The algorithm is based on the c...
متن کاملHierarchical Basis Preconditioners for Coupled Fem{bem Equations
SUMMARY The purpose of this paper is to present a nearly optimal preconditioned iterative method to solve indeenite linear systems of equations arising from h-adaptive procedures for the symmetric coupling of Finite Elements and Boundary Elements. This solver is nearly optimal in the sense, that its convergence rate grows only logarithmically with the number of unknowns. The algorithm is based ...
متن کامل